Algorithmic Aspects of Lipschitz Functions
نویسندگان
چکیده
منابع مشابه
Algorithmic Aspects of Lipschitz Functions
We characterize the variation functions of computable Lipschitz functions. We show that a real z is computably random if and only if every computable Lipschitz function is differentiable at z. Furthermore, a real z is Schnorr random if and only if every Lipschitz function with L1-computable derivative is differentiable at z. For the implications from left to right we rely on literature results....
متن کاملInterpolation of Lipschitz functions
This paper describes a new computational approach to multivariate scattered data interpolation. It is assumed that the data is generated by a Lipschitz continuous function f. The proposed approach uses the central interpolation scheme, which produces an optimal interpolant in the worst case scenario. It provides best uniform error bounds on f, and thus translates into reliable learning of f. Th...
متن کاملAlgorithmic Aspects of Regularity
Szemer edi's celebrated regularity lemma proved to be a fundamental result in graph theory. Roughly speaking, his lemma states that any graph may be approximated by a union of a bounded number of bipartite graphs, each of which is`pseudorandom'. As later proved by Alon, Duke, Lefmann, RR odl, and Yuster, there is a fast deterministic algorithm for nding such an approximation, and therefore many...
متن کاملAlgorithmic Aspects of Boosting
We discuss algorithmic aspects of boosting techniques, such as Majority Vote Boosting [Fre95], AdaBoost [FS97], and MadaBoost [DW00a]. Considering a situation where we are given a huge amount of examples and asked to find some rule for explaining these example data, we show some reasonable algorithmic approaches for dealing with such a huge dataset by boosting techniques. Through this example, ...
متن کاملControlling Lipschitz functions
Given any positive integers m and d, we say the a sequence of points (xi)i∈I in Rm is Lipschitz-d-controlling if one can select suitable values yi (i ∈ I) such that for every Lipschitz function f : Rm → Rd there exists i with |f(xi)−yi| < 1. We conjecture that for every m ≤ d, a sequence (xi)i∈I ⊂ Rm is d-controlling if and only if sup n∈N |{i ∈ I : |xi| ≤ n}| nd =∞. We prove that this conditio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computability
سال: 2014
ISSN: 2211-3568
DOI: 10.3233/com-14025